Harmony Search Algorithm for Minimizing Assembly Variation in Non-linear Assembly

The proposed work aims to acquire the maximum number of non-linear assemblies with closer assembly tolerance specifications by mating different bins’ components. Before that, components are classified based on range values and grouped into bins. Further, manufacturing process is selected from given known alternative processes. It incredibly tedious obtain best combinations bins together. Hence, a novel approach using combination univariate search method harmony algorithm in this work. Overrunning clutch taken as an example. overrunning manufactured wide value alternatives method. three nine A obtained for various implementing algorithm. efficacy demonstrated showing 24.9% cost-savings while making compared existing results show that contribution methodology legitimate solving selective problems.